Control in Boolean Networks With Model Checking
نویسندگان
چکیده
Understanding control mechanisms in biological systems plays a crucial role important applications, for instance cell reprogramming. Boolean modeling allows the identification of possible efficient strategies, helping to reduce usually high and time-consuming experimental efforts. Available approaches strategy focus either on attractor or phenotype control, are unable deal with more complex problems, avoidance. They also fail capture, many situations, all minimal finding instead only sub-optimal solutions. In order fill these gaps, we present novel approach networks based model checking. The method is guaranteed identify provides maximal flexibility definition target. We investigate applicability by considering range problems different systems, comparing results, where possible, those obtained alternative methods.
منابع مشابه
Model checking with Boolean Satisfiability
The evolution of SAT algorithms over the last decade has motivated the application of SAT to model checking, initially through the use of SAT in bounded model checking and, more recently, in unbounded model checking. This paper provides an overview of modern SAT algorithms, SAT-based bounded model checking and some of the most promising approaches for unbounded model checking, namely induction ...
متن کاملModel Checking Boolean Programs
The reliability of software is crucial to the functioning of today’s world, which heavily depends on computer systems. Given the ever increasing complexity of software, bugs are subtle and thus hard to find with manual inspection. A more promising approach is to use a formal method such as model checking, which employs exhaustive state-space search to ensure the correctness of the software. How...
متن کاملModel Checking with Quantified Boolean Formulas
Modern symbolic model checking techniques use Binary Decision Diagrams (BDD) and propositional satisfiability (SAT) decision procedures for checking validity and satisfiability of propositional Boolean formulas, which are used to encode sub-problems of symbolic model checking. Usage of propositional formulas imposes a potential exponential memory blow-up on the model checking algorithms due to ...
متن کاملApproximating Attractors of Boolean Networks by Iterative CTL Model Checking
This paper introduces the notion of approximating asynchronous attractors of Boolean networks by minimal trap spaces. We define three criteria for determining the quality of an approximation: "faithfulness" which requires that the oscillating variables of all attractors in a trap space correspond to their dimensions, "univocality" which requires that there is a unique attractor in each trap spa...
متن کاملMarkov Model Checking of Probabilistic Boolean Networks Representations of Genes
Our goal is to develop an algorithm for the automated study of the dynamics of Probabilistic Boolean Network (PBN) representation of genes. Model checking is an automated method for the verification of properties on systems. Continuous Stochastic Logic (CSL), an extension of Computation Tree Logic (CTL), is a model-checking tool that can be used to specify measures for Continuous-time Markov Ch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers in Applied Mathematics and Statistics
سال: 2022
ISSN: ['2297-4687']
DOI: https://doi.org/10.3389/fams.2022.838546